skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Kottegoda, Kapila"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Networks)
    ABSTRACT Spanning tree modulus is a generalization of effective resistance that is closely related to graph strength and fractional arboricity. The optimal edge density associated with the spanning tree modulus is known to produce two hierarchical decompositions of arbitrary graphs, one based on strength and the other on arboricity. Here we introduce an exact‐arithmetic algorithm for spanning tree modulus and the strength‐based decomposition using Cunningham's algorithm for graph vulnerability. The algorithm exploits an interesting connection between the spanning tree modulus and critical edge sets from the vulnerability problem. This paper introduces the new algorithm, describes a practical means for implementing it using integer arithmetic, and presents some examples and computational time scaling tests. 
    more » « less